Explicit polyhedral approximation of the Euclidean ball

نویسندگان

  • J. Frédéric Bonnans
  • Marc Lebelle
چکیده

We discuss the problem of computing points of IR whose convex hull contains the Euclidean ball, and is contained in a small multiple of it. Given a polytope containing the Euclidean ball, we introduce its successor obtained by intersection with all tangent spaces to the Euclidean ball, whose normals point towards the vertices of the polytope. Starting from the L∞ ball, we discuss the computation of the two first successors, and give a complete analysis in the case when n = 6.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximations of 3D generalized Voronoi diagrams

We introduce a new approach to approximate generalized 3D Voronoi diagrams for different site shapes (points, spheres, segments, lines, polyhedra, etc) and different distance functions (Euclidean metrics, convex distance functions, etc). The approach is based on an octree data structure denoted Voronoi-Octree (VO) that encodes the information required to generate a polyhedral approximation of t...

متن کامل

Robust portfolio selection with polyhedral ambiguous inputs

 Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...

متن کامل

From the Lorentz Transformation Group in Pseudo-Euclidean Spaces to Bi-gyrogroups

‎The Lorentz transformation of order $(m=1,n)$‎, ‎$ninNb$‎, ‎is the well-known ‎Lorentz transformation of special relativity theory‎. ‎It is a transformation of time-space coordinates of the ‎pseudo-Euclidean space $Rb^{m=1,n}$ of one time dimension and ‎$n$ space dimensions ($n=3$ in physical applications)‎. ‎A Lorentz transformation without rotations is called a {it boost}‎. ‎Commonly‎, ‎the ...

متن کامل

Flying over a polyhedral terrain

We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p ≥ 1, computes a (c + ε)approximation to the Lp-shortest path above a polyhedral terrain in O( ε log n log log n) time and O(n log n) space, where n is the number of vertices of the terrain, and c = 2(p−1)/p. This leads to a F...

متن کامل

Degree Reduction of Disk Wang-Bézier Type Generalized Ball Curves

A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • RAIRO - Operations Research

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2010